Inducing implication relations
نویسندگان
چکیده
This paper deals with learning implication relations from some kinds of knowledge (statistical studies, possibilistic information or possible worlds) about truth valuations on a set of propositions. An induction principle is considered in each one of this cases. If only the possible valuations are known, then it is checked when two families of possible valuations produce the same implication. A conditional probability can be deduced when a probabilistic information for each possible valuation is added. In particular, by applying equiprobability when this information is unknown, each preorder can be extended to a "causal" networks which contains it. Changing probability for possibilistic information, conditional possibility and necessity measures are suggested. This conditional measures extend the classical case if the respective information is forgotten. Finally, material implication is studied in Multiple Valued Logic.
منابع مشابه
An Algorithm for Inducing Least Generalization Under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization operators used are mainly based on three generality orderings subsumption, implication and implication relative to background knowledge. Implication is stronger than subsumption, but relative implication is more powerful b...
متن کاملVague Congruences and Quotient Lattice Implication Algebras
The aim of this paper is to further develop the congruence theory on lattice implication algebras. Firstly, we introduce the notions of vague similarity relations based on vague relations and vague congruence relations. Secondly, the equivalent characterizations of vague congruence relations are investigated. Thirdly, the relation between the set of vague filters and the set of vague congruence...
متن کاملA Method of Learning Implication Networks from Empirical Data: Algorithm and Monte-Carlo Simulation-Based Validation
This paper describes an algorithmic means for inducing implication networks from empirical data samples. The induced network enables efficient inferences about the values of network nodes if certain observations are made. This implication induction method is approximate in nature as probablistic network requirements are relaxed in the construction of dependence relationships based on statistica...
متن کاملBrief study of the relation between AGM postulates (-7) and (+7) under non-classical logics
This paper studies the implication relations between the AGM postulates ( 7) and (+̇7) under non-classical logics, namely intuitionistic logic, paraconsistent logic, G3 and G3'. In order to do so, some theorems on the implication relations between such postulates are drawn for logics with a special set of axioms. These are later used to deduce similar results under the four logics of interest. T...
متن کاملOn the Implication of Multivalued Dependencies in Partial Database Relations
The implication of multivalued dependencies (MVDs) in relational databases has originally and independently been denned in the context of some fixed finite universe by Delobel, Fagin, and Zaniolo. Biskup observed that the original axiomatisation for MVD implication does not reflect the fact that the complementation rule is merely a means to achieve database normalisation. He proposed two altern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 10 شماره
صفحات -
تاریخ انتشار 1994